Rational transformation from Schur to Jordan form
نویسندگان
چکیده
منابع مشابه
Jordan Normal and Rational Normal Form Algorithms
X iv :c s/ 04 12 00 5v 1 [ cs .S C ] 2 D ec 2 00 4 Jordan Normal and Rational Normal Form Algorithms Bernard Parisse, Morgane Vaughan Institut Fourier CNRS-UMR 5582 100 rue des Maths Université de Grenoble I 38402 St Martin d'Hères Cédex Résumé In this paper, we present a determinist Jordan normal form algorithms based on the Fadeev formula : (λ · I − A) ·B(λ) = P (λ) · I where B(λ) is (λ · I −...
متن کاملThe Rational Schur Algebra
We extend the family of classical Schur algebras in type A, which determine the polynomial representation theory of general linear groups over an infinite field, to a larger family, the rational Schur algebras, which determine the rational representation theory of general linear groups over an infinite field. This makes it possible to study the rational representation theory of such general lin...
متن کاملEigenvalue bounds from the Schur form
Computing the partial Schur form of a matrix is a common kernel in widely used software for solving eigenvalues problems. Partial Schur forms and Schur vectors also arise naturally in deeation techniques. In this paper, error bounds are proposed which are based on the Schur form of a matrix. We show how the bounds derived for the general case simplify in special situations such as those of Herm...
متن کاملUsing the generalized Schur form to solve a multivariate linear rational expectations model
In this paper, I show how to use the generalized Schur form to solve a system of linear expectational di!erence equations (a multivariate linear rational expectations model). The method is simple to understand and to use, and is applicable to a large class of rational expectations models. The only hard part is taken care of by just two standard algorithms, both of which are available as freewar...
متن کاملJordan Canonical Form with Parameters from Frobenius Form with Parameters
The Jordan canonical form (JCF) of a square matrix is a foundational tool in matrix analysis. If the matrix A is known exactly, symbolic computation of the JCF is possible though expensive. When the matrix contains parameters, exact computation requires either a potentially very expensive case discussion, significant expression swell or both. For this reason, no current computer algebra system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1992
ISSN: 0898-1221
DOI: 10.1016/0898-1221(92)90072-p